-
1 edge-colorable graph
Большой англо-русский и русско-английский словарь > edge-colorable graph
-
2 edge-colorable graph
Математика: реберно раскрашиваемый граф -
3 edge-colorable graph
English-Russian scientific dictionary > edge-colorable graph
-
4 graph
1) граф2) график || строить график3) диаграмма || чертить диаграмму•- alternating composition graph - arbitrarily transversable graph - derived graph - doubly connected graph - doubly transitive graph - fully connected graph - locally countable graph - locally finite graph - locally restricted graph - log-log graph - partially labeled graph - partially orderable graph - progressively finite graph - regressively finite graph - strictly weak graph - strongly orientable graph - strongly regular graph - strongly rigid graph - strongly singular graph - strongly smooth graph - totally inductive graph - triangleless graph - triply transitive graph - uniquely intersectable graph - uniquely representable graph - weakly disconnected graph -
5 graph
1) граф2) график; кривая || строить график; вычерчивать кривую3) диаграмма || представлять в виде диаграммы4) вчт моносимвольная графема, граф•- graph of strictly partial order
- acyclic graph
- alternating graph
- alternating-composition graph
- animated bar graph
- area graph
- associated undirected graph
- atomic graph
- attachment graph
- balanced signed graph
- bar graph
- basis graph
- bicolorable graph
- bicolored graph
- bipartite graph
- block graph
- bunch graph
- Cayley's graph
- circuit closed graph
- circuit connected graph
- circuit-free graph
- clique graph
- color graph
- colored graph
- column graph
- columnar graph
- communication graph
- complete graph
- connected graph
- converse graph
- coordinate graph
- critical graph
- current graph
- cyclic graph
- data flow graph
- Desargues' graph
- descendence graph
- directed graph
- dual Y-axis graph
- Euler graph
- Eulerian graph
- even graph
- exclusion graph
- exploded pie graph
- finite graph
- flat graph
- fractal graph
- function graph
- fuzzy graph
- general graph
- graceful graph
- Hamilton graph
- Hamiltonian graph
- high/low/close/open graph
- HLCO graph
- horizontal bar graph
- identity graph
- implication graph
- infinite graph
- interaction graph
- interchange graph
- interval graph
- isomorphic graph
- k-chromatic graph
- k-colorable graph
- k-edge connected graph
- knot graph
- labeled graph
- labeled semantic graph
- levelized graph
- line graph
- linked pie-column graph
- line-symmetric graph
- lobe graph
- locally finite graph
- locally restricted graph
- logarithmic graph
- l-vertex connected graph
- maximal strongly singular graph
- mixed graph
- mixed column/line graph
- m-partite graph
- multidimensional graph
- mutually connected graph
- net graph
- network graph
- nonseparable graph
- numbered undirected graph
- one hundred percent column graph
- one-way graph
- operator graph
- oriented graph
- paired bar graph
- paired pie graph
- Pappus' graph
- Petersen graph
- phonetic graph
- picture graph
- pie graph
- planar graph
- plane graph
- point-symmetric graph
- proportional pie graph
- R-graph
- recursively structured graph
- reduced-flow graph
- region adjacency graph
- regular graph of degree n
- reproduction graph
- rigid circuit graph
- rooted graph
- scatter graph
- sectional graph
- self-complementary graph
- selt-negational signed graph
- semilogarithmic graph
- signal graph
- signal-flow graph
- signed graph
- signed labeled graph
- singular graph
- spanning graph
- stacked column graph
- star graph
- state graph
- strongly cyclically closed graph
- strongly cyclic edge connected graph
- subdivision graph
- symmetric graph
- total graph
- transaction graph
- transition graph
- transitive graph
- transmission graph
- tripartite graph
- two-dimensional lattice graph
- two-partite graph
- undirected graph
- unicyclic graph
- vertex critical graph
- vertical bar graph
- x-y graph -
6 graph
1) граф2) график; кривая || строить график; вычерчивать кривую3) диаграмма || представлять в виде диаграммы4) вчт. моносимвольная графема, граф•- alternating graph
- alternating-composition graph
- animated bar graph
- area graph
- associated undirected graph
- atomic graph
- attachment graph
- balanced signed graph
- bar graph
- basis graph
- bicolorable graph
- bicolored graph
- bipartite graph
- block graph
- bunch graph
- Cayley's graph
- circuit closed graph
- circuit connected graph
- circuit-free graph
- clique graph
- color graph
- colored graph
- column graph
- columnar graph
- communication graph
- complete graph
- connected graph
- converse graph
- coordinate graph
- critical graph
- current graph
- cyclic graph
- data flow graph
- Desargues' graph
- descendence graph
- directed graph
- dual Y-axis graph
- Euler graph
- Eulerian graph
- even graph
- exclusion graph
- exploded pie graph
- finite graph
- flat graph
- fractal graph
- function graph
- fuzzy graph
- general graph
- graceful graph
- graph of contiguous channels
- graph of strictly partial order
- Hamilton graph
- Hamiltonian graph
- high/low/close/open graph
- HLCO graph
- horizontal bar graph
- identity graph
- implication graph
- infinite graph
- interaction graph
- interchange graph
- interval graph
- isomorphic graph
- k-chromatic graph
- k-colorable graph
- k-edge connected graph
- knot graph
- labeled graph
- labeled semantic graph
- levelized graph
- line graph
- line-symmetric graph
- linked pie-column graph
- lobe graph
- locally finite graph
- locally restricted graph
- logarithmic graph
- l-vertex connected graph
- maximal strongly singular graph
- mixed column/line graph
- mixed graph
- m-partite graph
- multidimensional graph
- mutually connected graph
- net graph
- network graph
- nonseparable graph
- numbered undirected graph
- one hundred percent column graph
- one-way graph
- operator graph
- oriented graph
- paired bar graph
- paired pie graph
- Pappus' graph
- Petersen graph
- phonetic graph
- picture graph
- pie graph
- planar graph
- plane graph
- point-symmetric graph
- proportional pie graph
- recursively structured graph
- reduced-flow graph
- region adjacency graph
- regular graph of degree n
- reproduction graph
- R-graph
- rigid circuit graph
- rooted graph
- scatter graph
- sectional graph
- self-complementary graph
- selt-negational signed graph
- semilogarithmic graph
- signal graph
- signal-flow graph
- signed graph
- signed labeled graph
- singular graph
- spanning graph
- stacked column graph
- star graph
- state graph
- strongly cyclic edge connected graph
- strongly cyclically closed graph
- subdivision graph
- symmetric graph
- total graph
- transaction graph
- transition graph
- transitive graph
- transmission graph
- tripartite graph
- two-dimensional lattice graph
- two-partite graph
- undirected graph
- unicyclic graph
- vertex critical graph
- vertical bar graph
- x-y graphThe New English-Russian Dictionary of Radio-electronics > graph
-
7 реберно раскрашиваемый граф
Большой англо-русский и русско-английский словарь > реберно раскрашиваемый граф
См. также в других словарях:
Uniquely colorable graph — In graph theory, a uniquely colorable graph is a k chromatic graph that has only one possible (proper) k coloring up to permutation of the colors. Example 1 . A minimal imperfect graph is a graph in which every subgraph is perfect. The deletion… … Wikipedia
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
Cycle graph — This article is about connected, 2 regular graphs. For other uses, see Cycle graph (disambiguation). Cycle graph A cycle graph of length 6 Vertices n … Wikipedia
Triangle-free graph — In the mathematical area of graph theory, a triangle free graph is an undirected graph in which no three vertices form a triangle of edges. Triangle free graphs may be equivalently defined as graphs with clique number ≤ 2, graphs with girth ≥ 4,… … Wikipedia
Petersen graph — Infobox graph name = Petersen graph image caption = The Petersen graph is most commonly drawn as a pentagon with a pentagram inside, with five spokes. namesake = Julius Petersen vertices = 10 edges = 15 radius = 2 diameter = 2 girth = 5 chromatic … Wikipedia
Tietze's graph — The Tietze s graph Vertices 12 Edges 18 Diameter … Wikipedia
List of graph theory topics — This is a list of graph theory topics, by Wikipedia page. See glossary of graph theory for basic terminology Contents 1 Examples and types of graphs 2 Graph coloring 3 Paths and cycles 4 … Wikipedia
Meredith graph — The Meredith graph Named after G. H. Meredith Vertices 70 Edges 140 … Wikipedia
Snark (graph theory) — In graph theory, a snark is a connected, bridgeless cubic graph with chromatic index equal to 4. In other words, it is a graph in which every vertex has three neighbors, and the edges cannot be colored by three colors without two edges of the… … Wikipedia